A smallest graph of girth 5 and valency 5
نویسندگان
چکیده
منابع مشابه
On Locally Projective Graphs of Girth 5
Let0 be a graph and G be a 2-arc transitive automorphism group of0. For a vertex x ∈ 0 let G(x)0(x) denote the permutation group induced by the stabilizer G(x) of x in G on the set 0(x) of vertices adjacent to x in 0. Then 0 is said to be a locally projective graph of type (n, q) if G(x)0(x) contains PSLn(q) as a normal subgroup in its natural doubly transitive action. Suppose that 0 is a local...
متن کاملChoosability of planar graphs of girth 5
Thomassen proved that any plane graph of girth 5 is list-colorable from any list assignment such that all vertices have lists of size two or three and the vertices with list of size two are all incident with the outer face and form an independent set. We present a strengthening of this result, relaxing the constraint on the vertices with list of size two. This result is used to bound the size o...
متن کاملAffine extensions of the petersen graph and 2-arc-transitive graphs of girth 5
are considered in this paper. Examples of finite Qn-geometries are constructed for any n i> 2. In particular, we obtain new examples of finite 2-arc-transitive graphs of girth 5, containing Petersen subgraphs (cf. [4], [5] for an enquiry into this class of graphs). Furthermore, we give a complete classification of Q2-geometries using coset enumeration. In particular, we show that they are all f...
متن کاملGirth 5 Graphs from Elliptic Semiplanes
For 3 ≤ k ≤ 20 with k 6= 4, 8, 12, all the smallest currently known k–regular graphs of girth 5 have the same orders as the girth 5 graphs obtained by the following construction: take a (not necessarily Desarguesian) elliptic semiplane S of order n− 1 where n = k − r for some r ≥ 1; the Levi graph Γ (S) of S is an n–regular graph of girth 6; parallel classes of S induce co–cliques in Γ (S), som...
متن کاملGirth 5 graphs from relative difference sets
We consider the problem of construction of graphs with given degree k and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G. Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90003-8